Evolutionary Hamiltonian Graph Theory
نویسنده
چکیده
We present an alternative domain concerning mathematics to investigate universal evolution mechanisms by focusing on large cycles theory (LCT)-a simplified version of well-known hamiltonian graph theory. LCT joins together a number of N P-complete cycle problems in graph theory. N P-completeness is the kay factor insuring (by conjecture of Cook) the generation of endless developments and great diversity around large cycles problems. Originated about 60 years ago, the individuals (claims, propositions, lemmas, conjectures, theorems, and so on) in LCT continually evolve and adapt to their environment by an iterative process from primitive beginnings to best possible theorems based on inductive reasoning. LCT evolves much more rapidly than biosphere and has a few thousand pronounced species (theorems). Recall that life on earth with more than 2 million species was originated about 3.7 billion years ago and evolves extremely slowly. We show that all theorems in LCT have descended from some common primitive propositions such as " every complete graph is hamiltonian " or " every graph contains a cycle of length at least one " via improvements, modifications and three kinds of generalizations closing , associating and extending. It is reasonable to review Darwinian mechanisms in light of LCT evolution mechanisms (especially inductive reasoning) including the origin and macroevolution disputable phenomena in the biosphere.
منابع مشابه
Geometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملEffective Hamiltonian of Electroweak Penguin for Hadronic b Quark Decays
In this research we work with the effective Hamiltonian and the quark model. We investigate the decay rates of matter-antimatter of quark. We describe the effective Hamiltonian theory and apply this theory to the calculation of current-current ( ), QCD penguin ( ), magnetic dipole ( ) and electroweak penguin ( ) decay rates. The gluonic penguin structure of hadronic decays is studied thro...
متن کاملHamilton cycles in prisms
The prism over a graph G is the Cartesian product G2K2 of G with the complete graph K2. If G is hamiltonian, then G2K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be an interesting relaxation of being hamiltonian. In this paper, we examine classical problems on hamiltonicity of graphs in the context of having a hamiltonian prism. c © ???...
متن کاملOn s-Hamiltonian Line Graphs
For an integer s ≥ 0, a graph G is s-hamiltonian if for any vertex subset S′ ⊆ V (G) with |S′| ≤ s, G − S′ is hamiltonian. It is well known that if a graph G is s-hamiltonian, then G must be (s + 2)-connected. The converse is not true, as there exist arbitrarily highly connected nonhamiltonian graphs. But for line graphs, we prove that when s ≥ 5, a line graph is s-hamiltonian if and only if it...
متن کاملDegree conditions for k-ordered hamiltonian graphs
For a positive integer k, a graph G is k-ordered hamiltonian if for every ordered sequence of k vertices there is a hamiltonian cycle that encounters the vertices of the sequence in the given order. It is shown that if G is a graph of order n with 3 k n /2, and deg(u)þ deg(v ) nþ (3k 9)/2 for every pair u; v of nonadjacent vertices of G, then G is k-ordered hamiltonian. Minimum degree condition...
متن کامل